Random trees constructed by aggregation
نویسندگان
چکیده
منابع مشابه
Branches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملLocally-Constructed Trees for Adhoc Routing
We present a family of self-stabilizing distributed algorithms to built a spanning tree on the underlaying communications graph of an adhoc wireless network. Next, based on this principle, we show how to construct two overlaying trees which are suitable for routing tasks.
متن کاملDecomposing almost complete graphs by random trees
An old conjecture of Ringel states that every tree with m edges decomposes the complete graph K2m+1. The best lower bound for the order of a complete graph decomposed by a given tree with m edge is O(m). We show that asymptotically almost surely a random tree with m edges and p = 2m + 1 a prime decomposes K2m+1(r) for every r ≥ 2, the graph obtained from the complete graph K2m+1 by replacing ea...
متن کاملRandom Trees in Random Graphs
We show that a random labeled n-vertex graph almost surely contains isomorphic copies of almost all labeled n-vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n increases, and the set of trees referred to as "almost all" depends on the random graph. In the other sense, the probability of an edge occurring is fixed, and the releva...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2017
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.3126